By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 21, Issue 1, pp. 1-272

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A New Min-Cut Max-Flow Ratio for Multicommodity Flows

Oktay Günlük

pp. 1-15

BibTeX  Abstract Full Text:  PDF

A Simple Gray Code to List All Minimal Signed Binary Representations

J. Sawada

pp. 16-25

BibTeX  Abstract Full Text:  PDF

Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs

Bostjan Bresar and Sandi Klavzar

pp. 26-32

BibTeX  Abstract Full Text:  PDF

Correlation of Graph-Theoretical Indices

Stephan G. Wagner

pp. 33-46

BibTeX  Abstract Full Text:  PDF

The Spectrum of the Corona of Two Graphs

S. Barik, S. Pati, and B. K. Sarma

pp. 47-56

BibTeX  Abstract Full Text:  PDF

Sharp Threshold for Hamiltonicity of Random Geometric Graphs

Josep Díaz, Dieter Mitsche, and Xavier Pérez

pp. 57-65

BibTeX  Abstract Full Text:  PDF

Turán's Theorem in the Hypercube

Noga Alon, Anja Krech, and Tibor Szabó

pp. 66-72

BibTeX  Abstract Full Text:  PDF

Every Monotone $3$-Graph Property is Testable

Christian Avart, Vojtech Rödl, and Mathias Schacht

pp. 73-92

BibTeX  Abstract Full Text:  PDF

A Generalization of Kotzig's Theorem and Its Application

Richard Cole, Lukasz Kowalik, and Riste Škrekovski

pp. 93-106

BibTeX  Abstract Full Text:  PDF

Operations on M-Convex Functions on Jump Systems

Yusuke Kobayashi, Kazuo Murota, and Ken'ichiro Tanaka

pp. 107-129

BibTeX  Abstract Full Text:  PDF

A Natural Family of Flag Matroids

Anna de Mier

pp. 130-140

BibTeX  Abstract Full Text:  PDF

Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks

Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman

pp. 141-157

BibTeX  Abstract Full Text:  PDF

The Complexity of Combinatorial Optimization Problems on $d$-Dimensional Boxes

Miroslav Chlebík and Janka Chlebíková

pp. 158-169

BibTeX  Abstract Full Text:  PDF

Vertex-Magic Total Labelings of Regular Graphs

Ian D. Gray

pp. 170-177

BibTeX  Abstract Full Text:  PDF

Two New Bounds for the Random-Edge Simplex-Algorithm

Bernd Gärtner and Volker Kaibel

pp. 178-190

BibTeX  Abstract Full Text:  PDF

Quadratically Many Colorful Simplices

Imre Bárány and Jiří Matoušek

pp. 191-198

BibTeX  Abstract Full Text:  PDF

On Nearly Orthogonal Lattice Bases and Random Lattices

Ramesh Neelamani, Sanjeeb Dash, and Richard G. Baraniuk

pp. 199-219

BibTeX  Abstract Full Text:  PDF

A Primal Barvinok Algorithm Based on Irrational Decompositions

Matthias Köppe

pp. 220-236

BibTeX  Abstract Full Text:  PDF

Adjacent Vertex Distinguishing Edge-Colorings

P. N. Balister, E. Gyori, J. Lehel, and R. H. Schelp

pp. 237-250

BibTeX  Abstract Full Text:  PDF

On the Minimum Order of Extremal Graphs to have a Prescribed Girth

C. Balbuena and P. García–Vázquez

pp. 251-257

BibTeX  Abstract Full Text:  PDF

Precoloring Extension for 2-connected Graphs

Margit Voigt

pp. 258-263

BibTeX  Abstract Full Text:  PDF

Graphs Having Small Number of Sizes on Induced k-Subgraphs

Maria Axenovich and József Balogh

pp. 264-272

BibTeX  Abstract Full Text:  PDF